Magic labelings of triangles

On magic labelings of honeycomb

BaEa, M., On magic labelings of honeycomb, Discrete Mathematics 105 (1992) 305-311. We deal with the problem of labeling the vertices, edges and faces of a hexagonal planar map in such a way that the label of a face and labels of vertices and edges surrounding that face add up to a fixed value.

Totally magic labelings of graphs

Distance magic labelings of graphs

As a natural extension of previously defined graph labelings, we introduce in this paper a new magic labeling whose evaluation is based on the neighbourhood of a vertex. We define a 1-vertex-magic vertex labeling of a graph with v vertices as a bijection f taking the vertices to the integers 1, 2, . . . , v with the property that there is a constant k such that at any vertex x, ∑ y∈N(x) f(y) = ...

Cube-magic labelings of grids

The graphs considered in this paper are finite, undirected and simple. For a graph G, we denote its vertex set by V (G) and its edge set by E(G). A graph labeling, as introduced in [8], is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Over the years, a large variety of different types of graph labelings have been studied, see [2] for an extensive su...

Edge-magic total labelings

Various graph labelings that generalize the idea of a magic square have been discussed. In particular a magic labeling on a graph with v vertices and e edges will be defined as a one-to-one map taking the vertices and edges onto the integers 1, 2, ... , v+e with the property that the sum of the label on an edge and the labels of its endpoints is constant independent of the choice of edge. Prope...